Classes of Boolean Formulae with Effectively Solvable SAT
نویسنده
چکیده
We present an overview of known classes of Boolean formulae for which polynomial time algorithms for satisfiability testing (SAT) are known. We will summarize basic properties of these classes and their mutual relations with respect to inclusion. One of these classes on which we focus our attention in particular is the class of Single Lookahead Unit Resolution formulae (SLUR). We will define a hierarchy of classes which constitutes a generalization of the SLUR class, and prove its properties.
منابع مشابه
#2,2-sat Is Solvable in Linear-time
A linear-time algorithm, with respect to the size of the instance Boolean formula, is presented for the #SAT problem restricted to formulae of the form #2; 2-CF, i.e. formulae whose clauses have just two literals and in which each variable appears at most twice.
متن کاملHorn renamability and hypergraphs
The satisfiability problem, SAT, consisting of testing the satisfiability of a propositional formula, is known to be NP-complete. On the other hand, several subclasses of propositional formulae are known, so that the restriction of SAT to such a subclass is solvable in polynomial time [7, 2] — among them Horn formulae [5] and formulae that are reducible toHorn, such as Horn-renamable formulae [...
متن کاملKnown and new classes of generalized Horn formulae with polynomial recognition and SAT testing
In this paper we study several classes of Boolean formulae which generalize Horn formulae while preserving one of their main properties, namely the fact that satisfiability is decidable in polynomial time. We compare the known classes with respect to inclusion and define a hierarchy of new classes, which properly contains some of the known classes. © 2005 Elsevier B.V. All rights reserved.
متن کاملHow to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms
The equivalence problem for monotone formulae in normal form Monet is in coNP, is probably not coNP-complete [10], and is solvable in quasi-polynomial time n [7]. We show that the straightforward reduction from Monet to UnSat yields instances, on which actual Sat-solvers (SAT4J) are slower than current implementations of Monet-algorithms [9]. We then improve these implementations of Monet-algor...
متن کاملWhen Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way
Recent research on Boolean satisfiability (SAT) reveals modern solvers’ inability to handle formulae in the abundance of parity (xor) constraints. Although xor-handling in SAT solving has attracted much attention, challenges remain to completely deduce xor-inferred implications and conflicts, to effectively reduce expensive overhead, and to directly generate compact interpolants. This paper int...
متن کامل